Pipage Rounding, Pessimistic Estimators and Matrix Concentration
نویسندگان
چکیده
Pipage rounding is a dependent random sampling technique that has several interesting properties and diverse applications. One property that has been particularly useful is negative correlation of the resulting vector. Unfortunately negative correlation has its limitations, and there are some further desirable properties that do not seem to follow from existing techniques. In particular, recent concentration results for sums of independent random matrices are not known to extend to a negatively dependent setting. We introduce a simple but useful technique called concavity of pessimistic estimators. This technique allows us to show concentration of submodular functions and concentration of matrix sums under pipage rounding. The former result answers a question of Chekuri et al. (2009). To prove the latter result, we derive a new variant of Lieb’s celebrated concavity theorem in matrix analysis. We provide numerous applications of these results. One is to spectrally-thin trees, a spectral analog of the thin trees that played a crucial role in the recent breakthrough on the asymmetric traveling salesman problem. We show a polynomial time algorithm that, given a graph where every edge has effective conductance at least κ, returns an O(κ · log n/ log logn)-spectrallythin tree. There are further applications to rounding of semidefinite programs, to the column subset selection problem, and to a geometric question of extracting a nearly-orthonormal basis from an isotropic distribution.
منابع مشابه
Randomized Pipage Rounding for Matroid Polytopes and Applications
We present concentration bounds for linear functions of random variables arising from the pipage rounding procedure on matroid polytopes. As an application, we give a (1 − 1/e − ǫ)-approximation algorithm for the problem of maximizing a monotone submodular function subject to 1 matroid and k linear constraints, for any constant k ≥ 1 and ǫ > 0. This generalizes the result for k linear constrain...
متن کاملLecture 9 : Pipage Rounding Method
In this lecture we study a different randomized rounding method called pipage rounding method. The materials of this lecture are based on the work of Chekuri, Vondrák and Zenklusen [CVZ10]. This method is stronger than the maximum entropy rounding by sampling method in some aspects and is weaker in some other aspects. From a highlevel point of view, one can use this method to round a fractional...
متن کاملOn the Pipage Rounding Algorithm for Submodular Function Maximization - a View from Discrete Convex Analysis
We consider the problem of maximizing a nondecreasing submodular set function under a matroid constraint. Recently, Calinescu et al. (2007) proposed an elegant framework for the approximation of this problem, which is based on the pipage rounding technique by Ageev and Sviridenko (2004), and showed that this framework indeed yields a (1 − 1/e)-approximation algorithm for the class of submodular...
متن کاملLecture 6 & 7 : O ( log ( n ) / log log ( n ) ) Approximation Algorithms for ATSP
In the next few lectures we will talk about three new variants of the classical randomized rounding technique, namely the rounding by sampling method, the pipage rounding method and the iterative rounding method. We will use these techniques to design approximation algorithms for Asymmetric TSP (ATSP) and the Steiner tree problems. The materials of the this lecture are based on the works of Asa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014